Image Steganography Based on Cellular Automata

In this paper, a new approach of image steganography using twodimensional Cellular Automata (2D-CA) has been proposed for a confidential message. We convert the message in such a way that message length becomes 1024 bits after padding some bits. If message size is more than 1024 bits, we subdivide the message of length 1024 bits using padding technique. Convert original message by XORing with shared secret key of length 1024 bits. Update the central pixel value of 3x3 2D-CA (rule 341) depending upon the parity (Odd or Even) of Least Significant Bits (LSB) of the cover work and converted bits of confidential message. During decoding only consider CA 341 rule and parity of LSB of stego image. XORing of decoded message and shared secret key, we can get the message of 1024 bits and combine different message component c © 2013 Academic Publications, Ltd. 702 B. Jana, D. Giri, S.K. Mondal, P. Pal to get the original message. Results are compared with the Discrete Wavelet Transform (DWT) based steganography schemes in terms of Peak Signal-toNoise Ratio (PSNR). This Image Steganography based on Cellular Automata (ISCA) method increases embedding capacity of confidential message. The security is measure by calculating the relative entropy between the probability distributions of the cover and stego image. AMS Subject Classification: 60A05